Induced Graphoidal Decompositions in Product Graphs
نویسندگان
چکیده
منابع مشابه
Induced label graphoidal graphs
Let G be a non-trivial, simple, finite, connected and undirected graph of order n and size m. An induced acyclic graphoidal decomposition (IAGD) of G is a collection ψ of non-trivial and internally disjoint induced paths in G such that each edge of G lies in exactly one path of ψ. For a labeling f : V → {1, 2, 3, . . . , n}, let ↑ Gf be the directed graph obtained by orienting the edges uv of G...
متن کاملProduct constructions for transitive decompositions of graphs
A decomposition of a graph is a partition of the edge set, giving a set of subgraphs. A transitive decomposition is a decomposition which is highly symmetrical, in the sense that the subgraphs are preserved and transitively permuted by a group of automorphisms of the graph. This paper describes some ‘product’ constructions for transitive decompositions of graphs, and shows how these may be used...
متن کاملDetour Monophonic Graphoidal Covering Number of Corona Product Graph of Some Standard Graphs with the Wheel
A chord of a path $P$ is an edge joining two non-adjacent vertices of $P$. A path $P$ is called a monophonic path if it is a chordless path. A longest $x-y$ monophonic path is called an $x-y$ detour monophonic path. A detour monophonic graphoidal cover of a graph $G$ is a collection $psi_{dm}$ of detour monophonic paths in $G$ such that every vertex of $G$ is an internal vertex of at most on...
متن کاملOn Graphoidal Covers of Bicyclic Graphs
A graphoidal cover of a graph G is a collection ψ of (not necessarily open) paths in G such that every path in ψ has at least two vertices, every vertex of G is an internal vertex of at most one path in ψ and every edge of G is in exactly one path in ψ. The minimum cardinality of a graphoidal cover of G is called the graphoidal covering number of G and is denoted by η(G) or η. Also, If every me...
متن کاملOn Edge Exchanges in Hamiltonian Decompositions of Kronecker-product Graphs
Let G be a connected graph on n vertices, and let ; ; and be edge-disjoint cycles in G such that (i) ; (resp. ;) are vertex-disjoint and (ii) jj + jj = jj+ jj = n, where jj denotes the length of. We say that ; ; and yield two edge-disjoint hamiltonian cycles by edge exchanges if the four cycles respectively contain edges e; f; g and h such that each of (? feg) S (? ffg) S fg; hg and (? fgg) S (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Mathematics
سال: 2013
ISSN: 2090-9837,2090-9845
DOI: 10.1155/2013/892839